superlinearly convergent exact penalty projected structured hessian updating schemes for constrained nonlinear least squares: asymptotic analysis

نویسندگان

n. mahdavi-amiri

mohammad reza ansari

چکیده

we present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step q-superlinear convergence. the approach is based on an adaptive structured scheme due to mahdavi-amiri and bartels of the exact penalty method of coleman and conn for nonlinearly constrained optimization problems. the structured adaptation also makes use of the ideas of nocedal and overton for handling the quasi-newton updates of projected hessians. we discuss the comparative results of the testing of our programs and three nonlinear programming codes from knitro on some randomly generated test problems due to bartels and mahdavi-amiri. the results indeed confirm the practical significance of our special considerations for the inherent structure of the least squares.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Superlinearly convergent exact penalty projected structured Hessian updating schemes for constrained nonlinear least squares: asymptotic analysis

We present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step Q-superlinear convergence. The approach is based on an adaptive structured scheme due to Mahdavi-Amiri and Bartels of the exact penalty method of Coleman and Conn for nonlinearly constrained optimization problems. The structured adaptation also makes use of the ideas of N...

متن کامل

Projected Structured Hessian Updating Schemes for Constrained Nonlinear Least Squares : Asymptotic Analysis

We present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step Q-superlinear convergence. The approach is based on an adaptive structured scheme due to Mahdavi-Amiri and Bartels of the exact penalty method of Coleman and Conn for nonlinearly constrained optimization problems. The structured adaptation also makes use of the ideas of N...

متن کامل

Constrained Nonlinear Least Squares: A Superlinearly Convergent Projected Structured Secant Method

Numerical solution of nonlinear least-squares problems is an important computational task in science and engineering. Effective algorithms have been developed for solving nonlinear least squares problems. The structured secant method is a class of efficient methods developed in recent years for optimization problems in which the Hessian of the objective function has some special structure. A pr...

متن کامل

Super linear Projected Structured Exact Penalty Secant Methods for Constrained Nonlinear Least Squares

We present an exact penalty approach for solving constrained nonlinear least squares problems, using a new projected structured Hessian approximation scheme. We establish general conditions for the local two-step Q-superlinear convergence of our given algorithm. The approach is general enough to include the projected version of the structured PSB, DFP and BFGS formulas as special cases. The num...

متن کامل

Using an Efficient Penalty Method for Solving Linear Least Square Problem with Nonlinear Constraints

In this paper, we use a penalty method for solving the linear least squares problem with nonlinear constraints. In each iteration of penalty methods for solving the problem, the calculation of projected Hessian matrix is required. Given that the objective function is linear least squares, projected Hessian matrix of the penalty function consists of two parts that the exact amount of a part of i...

متن کامل

A Unifying Analysis of Projected Gradient Descent for $ell_p$-constrained Least Squares

In this paper we study the performance of the Projected Gradient Descent (PGD) algorithm for lpconstrained least squares problems that arise in the framework of Compressed Sensing. Relying on the Restricted Isometry Property, we provide convergence guarantees for this algorithm for the entire range of 0 ≤ p ≤ 1, that include and generalize the existing results for the Iterative Hard Thresholdin...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
bulletin of the iranian mathematical society

ناشر: iranian mathematical society (ims)

ISSN 1017-060X

دوره 38

شماره 3 2012

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023